Probabilistic rounding and Sheppard’s correction

Rounding Probabilistic Expectations in Surveys.

Rounding is the familiar practice of reporting one value whenever a real number lies in an interval. Uncertainty about the extent of rounding is common when researchers analyze survey responses to numerical questions. The prevalent practice has been to take numerical responses at face value, even though many may in fact be rounded. This paper studies the rounding of responses to survey question...

Probabilistic crisscross error correction

The crisscross error model in data arrays is considered, where the corrupted symbols are confined to a prescribed number of rows or columns (or both). Under the additional assumption that the corrupted entries are uniformly distributed over the channel alphabet, and by allowing a small decoding error probability, a coding scheme is presented where the redundancy can get close to one half the re...

LP Relaxation , Rounding , and Randomized Rounding

1.1 Max-flow min-cut A flow network is a directed graph D = (V,E) with two distinguished vertices s and t called the source and the sink, respectively. Moreover, each arc (u, v) ∈ E has a certain capacity c(u, v) ≥ 0 assigned to it. Let X be a proper non-empty subset of V . Let X̄ := V −X , then the pair (X, X̄) forms a partition of V , called a cut of D. The set of arcs of D going from X to X̄ is...

Spelling correction using probabilistic methods

A probabilistic procedure is suggested for the automatic correction of spelling and typing errors in printed English texts. The heart of the procedure is a probabilistic model for the generation of the garbled word from the correct word. The garbler can delete or insert symbols in the word or substitute one or more symbols by other symbols. An expression is derived for P(Y I X), the probability...

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques